new skew laplacian energy of simple digraphs
Authors
abstract
for a simple digraph $g$ of order $n$ with vertex set${v_1,v_2,ldots, v_n}$, let $d_i^+$ and $d_i^-$ denote theout-degree and in-degree of a vertex $v_i$ in $g$, respectively. let$d^+(g)=diag(d_1^+,d_2^+,ldots,d_n^+)$ and$d^-(g)=diag(d_1^-,d_2^-,ldots,d_n^-)$. in this paper we introduce$widetilde{sl}(g)=widetilde{d}(g)-s(g)$ to be a new kind of skewlaplacian matrix of $g$, where $widetilde{d}(g)=d^+(g)-d^-(g)$ and$s(g)$ is the skew-adjacency matrix of $g$, and from which we definethe skew laplacian energy $sle(g)$ of $g$ as the sum of the norms ofall the eigenvalues of $widetilde{sl}(g)$. some lower and upperbounds of the new skew laplacian energy are derived and the digraphsattaining these bounds are also determined.
similar resources
New Skew Laplacian Energy of Simple Digraphs
For a simple digraph G of order n with vertex set {v1, v2, . . . , vn}, let d+i and d − i denote the out-degree and in-degree of a vertex vi in G, respectively. Let D (G) = diag(d+1 , d + 2 , . . . , d + n ) and D−(G) = diag(d1 , d − 2 , . . . , d − n ). In this paper we introduce S̃L(G) = D̃(G)−S(G) to be a new kind of skew Laplacian matrix of G, where D̃(G) = D+(G)−D−(G) and S(G) is the skew-adj...
full textMore skew-equienergetic digraphs
Two digraphs of same order are said to be skew-equienergetic if their skew energies are equal. One of the open problems proposed by Li and Lian was to construct non-cospectral skew-equienergetic digraphs on n vertices. Recently this problem was solved by Ramane et al. In this paper, we give some new methods to construct new skew-equienergetic digraphs.
full textextremal skew energy of digraphs with no even cycles
let $d$ be a digraph with skew-adjacency matrix $s(d)$. then the skew energyof $d$ is defined to be the sum of the norms of all eigenvalues of $s(d)$. denote by$mathcal{o}_n$ the class of digraphs on order $n$ with no even cycles, and by$mathcal{o}_{n,m}$ the class of digraphs in $mathcal{o}_n$ with $m$ arcs.in this paper, we first give the minimal skew energy digraphs in$mathcal{o}_n$ and $mat...
full textmore skew-equienergetic digraphs
two digraphs of same order are said to be skew-equienergetic if theirskew energies are equal. one of the open problems proposed by li andlian was to construct non-cospectral skew-equienergetic digraphs onn vertices. recently this problem was solved by ramane et al. inthis paper, we give some new methods to construct new skew-equienergeticdigraphs.
full textskew equienergetic digraphs
let $d$ be a digraph with skew-adjacency matrix $s(d)$. the skew energy of $d$ is defined as the sum of the norms of all eigenvalues of $s(d)$. two digraphs are said to be skew equienergetic if their skew energies are equal. we establish an expression for the characteristic polynomial of the skew adjacency matrix of the join of two digraphs, and for the respective skew energ...
full textLaplacian Simplices Associated to Digraphs
We associate to a finite digraph D a lattice polytope PD whose vertices are the rows of the Laplacian matrix of D. This generalizes a construction introduced by Braun and the third author. As a consequence of the Matrix-Tree Theorem, we show that the normalized volume of PD equals the complexity of D, and PD contains the origin in its relative interior if and only if D is strongly connected. In...
full textMy Resources
Save resource for easier access later
Journal title:
transactions on combinatoricsPublisher: university of isfahan
ISSN 2251-8657
volume 2
issue 1 2013
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023